Constructions of Goethals–Seidel Sequences by Using k-Partition

Efficient Top-k Query Algorithms Using K-Skyband Partition

Efficient processing of top-k queries has become a classical research area. Fagin et al. proposed the “middleware cost” for a top-k query algorithm. In some scenario, there is no way to perform a random access, and Fagin et al. proposed NRA (No Random Access) algorithm for that. In this paper, we investigate the intrinsic relation between top-k queries and K-skyband queries. Based on that relat...

an investigation into translation of cultural concepts by beginner and advance student using think – aloud protocols

this research aims at answering the questions about translation problems and strategies applied by translators when translating cultural concepts. in order to address this issue, qualitative and quantitative study were conducted on two groups of subjects at imam reza international university of mashhad. these two groups were assigned as beginner and advanced translation students (10 students). ...

Solving K-Set Partition Problem Using Genetic Algorithm

Adelic constructions of low discrepancy sequences

In [Fr2,Skr], Frolov and Skriganov showed that low discrepancy point sets in the multidimensional unit cube [0, 1)s can be obtained from admissible lattices in Rs. In this paper,we get a similar result for the case of (Fq((x))). Then we combine this approach with Halton’s construction of low discrepancy sequences.

New Constructions of p-ary Bent Sequences

In this paper, using bent functions defined on the finite field, we generalized the construction method of the family of p-ary bent sequences with balanced and optimal correlation property introduced by Kumar and Moreno for an odd prime p [3], called a generalized p-ary bent sequence. It turns out that the family of balanced p-ary sequences with optimal correlation property introduced by Moriuc...